منابع مشابه
Polymatroid Prophet Inequalities
Consider a gambler and a prophet who observe a sequence of independent, non-negative numbers. The gambler sees the numbers one-by-one whereas the prophet sees the entire sequence at once. The goal of both is to decide on fractions of each number they want to keep so as to maximize the weighted fractional sum of the numbers chosen. The classic result of Krengel and Sucheston (1977-78) asserts th...
متن کاملJohn Bartlett: appreciation & celebration.
When I was 6-years-old I wrote a letter to Roy Rogers, the cowboy star of movies and television, asserting that I was his biggest fan. That was the first and only fan letter I ever wrote. When I was invited to speak at a Festschrift for John Bartlett, I quickly replied, “I am much honored to be asked to be part of your proposed celebration of John. I can’t think of anyone in our discipline who ...
متن کاملBartlett Identities Tests
In this note we propose a general testing procedure for parametric models based on Bartlett Identities. A well-known example is the Information Matrix test, which is based on the Bartlett Identity of order 1. The Identities are shown to induce a sequence of testable restrictions on the data generating process. When all the restrictions are considered jointly, they are often complete, in the sen...
متن کاملJohn Bartlett and bioterrorism.
Until 1997, the subject of bioterrorism was not discussed within the medical community and deliberately ignored in national planning efforts. Biological weapons were regarded as "morally repulsive." This complacency stemmed from a 1972 Biological Weapons Convention where all countries agreed to cease offensive biological weapons research. In the 1990s, however, the Soviet Union was discovered t...
متن کاملCombinatorial Prophet Inequalities
We introduce a novel framework of Prophet Inequalities for combinatorial valuation functions. For a (non-monotone) submodular objective function over an arbitrary matroid feasibility constraint, we give an O(1)-competitive algorithm. For a monotone subadditive objective function over an arbitrary downward-closed feasibility constraint, we give an O(log n log r)-competitive algorithm (where r is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The American Archivist
سال: 1954
ISSN: 0360-9081
DOI: 10.17723/aarc.17.1.g176713634180851